package bTree.LeetCode;

public class 最长重复子数组 {
    public int findLength(int[] nums1, int[] nums2) {
        int length1 = nums1.length;
        int length2 = nums2.length;
        int [][]dp=new int[length1+1][length2+1];
        for (int i = 0; i < length1; i++) {
            dp[i][0]=0;
        }
        for (int i = 0; i < length2; i++) {
            dp[0][i]=0;
        }
        int res=0;
        for(int i=1;i<=length1;i++){
            for (int j=1;j<=length2;j++){
                if(nums1[i-1]==nums2[j-1]){
                    dp[i][j]=dp[i-1][j-1]+1;
                }
                res=Math.max(res,dp[i][j]);
            }
        }
        return res;
    }
}